A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem
نویسندگان
چکیده
Full truckload transportation (FTL) in the form of freight containers represents one most important modes international trade. Due to large volume and scale, FTL, delivery time is often less critical but cost service quality are crucial. Therefore, efficiently solving scale multiple shift FTL problems becoming more requires further research. In our earlier studies, a set covering model three-stage solution method were developed for multi-shift problem. This paper extends previous work presents significantly efficient approach by hybridising pricing cutting strategies with metaheuristics (a variable neighbourhood search genetic algorithm). The adopted find promising columns (vehicle routes) guided cuts dynamically generated eliminate infeasible flow assignments caused incompatible commodities. Computational experiments on real-life artificial benchmark showed superior performance both terms computational quality, when compared MIP based methods two existing metaheuristics. proposed heuristic can solve problems.
منابع مشابه
A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملA hybrid ACO algorithm for the Full Truckload Transportation Problem
In this paper we propose a hybrid ACO approach to solve a full truckload transportation problem. Hybridization is achieved through the use of a problem specific heuristic. This heuristic is utilized both, to initialize the pheromone information and to construct solutions in the ACO procedure. The main idea is to use information about the required fleetsize, by initializing the system with a num...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملProposing a Constrained-GSA for the Vehicle Routing Problem
In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2021
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2020.10.037